Recursive process definitions with the state operator
نویسندگان
چکیده
منابع مشابه
Positive Inductive-Recursive Definitions
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) → Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer and Setzer’s theory of inductive-recursive definitions within which C had to be discrete — our work can therefore be seen as lifting this restriction. This is a...
متن کاملRecursive definitions on surreal numbers
Let No be Conway’s class of surreal numbers. I will make explicit the notion of a function f on No recursively defined over some family of functions. Under some ‘tameness’ and uniformity conditions, f must satisfy some interesting properties; in particular, the supremum of the class ̆ x ∈ No : f (x) ≥ 0 ̄ is actually an element of No. As an application, I will prove that concatenation function x ...
متن کاملType Inference for Recursive Definitions
We consider type systems that combine universal types, recursive types, and object types. We study type inference in these systems under a rank restriction, following Leivant's notion of rank. To motivate our work, we present several examples showing how our systems can be used to type programs encountered in practice. We show that type inference in the ranksystem is decidable for and undecidab...
متن کاملRecursive Definitions of Monadic Functions
Alexander Krauss Technische Universität München, Institut für Informatik http://www.in.tum.de/~krauss Abstract Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL’s imperative programming extension, which results i...
متن کاملNon-primitive Recursive Function Definitions
This paper presents an approach to the problem of introducing non-primitive recursive function definitions in higher order logic. A recursive specification is translated into a domain theory version, where the recursive calls are treated as potentially non-terminating. Once we have proved termination, the original specification can be derived easily. A collection of algorithms are presented whi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90225-q